WORST_CASE(?,O(n^1))

Solution:
---------

  "a" :: [] -(8)-> "A"(7)
  "activate" :: ["A"(12)] -(15)-> "A"(5)
  "f" :: ["A"(12)] -(8)-> "A"(7)
  "g" :: ["A"(0)] -(11)-> "A"(15)
  "n__a" :: [] -(0)-> "A"(12)
  "n__a" :: [] -(0)-> "A"(14)
  "n__a" :: [] -(0)-> "A"(7)
  "n__f" :: ["A"(12)] -(12)-> "A"(12)
  "n__f" :: ["A"(7)] -(7)-> "A"(7)
  "n__g" :: ["A"(0)] -(0)-> "A"(12)
  "n__g" :: ["A"(0)] -(0)-> "A"(14)
  "n__g" :: ["A"(0)] -(0)-> "A"(15)


Cost Free Signatures:
---------------------

  "f" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "n__a" :: [] -(0)-> "A"_cf(0)
  "n__f" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "n__g" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"n__a\"_A" :: [] -(0)-> "A"(1)
  "\"n__f\"_A" :: ["A"(0)] -(1)-> "A"(1)
  "\"n__g\"_A" :: ["A"(0)] -(0)-> "A"(1)